Fair Resource Allocation in Systems With Complete Information Sharing

On efficient and fair scheduling in resource-sharing systems

In the context of communication networks and the Internet, resource-sharing systems have been widely studied. In this paper we give an overview of the main results obtained, and the main mathematical techniques used in the analysis of efficient and fair scheduling policies, or, more generally, in the performance evaluation and optimal control of resource-sharing systems. We discuss two main tec...

Balanced fair resource sharing in computer clusters

We represent a computer cluster as a multi-server queue with some arbitrary bipartite graph of compatibilities between jobs and servers. Each server processes its jobs sequentially in FCFS order. The service rate of a job at any given time is the sum of the service rates of all servers processing this job. We show that the corresponding queue is quasi-reversible and use this property to design ...

Fair resource allocation in active networks

Joint Fair Resource Allocation for Opportunistic Spectrum Sharing in OFDM-based Cognitive Radio Networks

This paper considers a cooperative Orthogonal Frequency Division Multiplexing (OFDM)-based cognitive radio network, where the primary system leases a fraction of its subcarriers to the secondary system in exchange for the secondary users (SUs) acting as decode-and-forward relays. Our aim is to determine an fair resource allocation strategy among the primary users and SUs as so to maximize the n...

Fair intergenerational sharing of a natural resource

In this article, overlapping generations are extracting a natural resource over an infinite future. We examine the fair allocation of resource and compensations among generations. Fairness is defined by core lower bounds and aspiration upper bounds. The core lower bounds require that every coalition of generations obtains at least what it could achieve by itself. The aspiration upper bounds req...